Autonomous mobility skeletons

نویسندگان

  • Xiao Yan Deng
  • Greg J. Michaelson
  • Philip W. Trinder
چکیده

To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of directly programming AMPs is that the cost model, mobility decision function, and network interrogation are all explicit in the program. This paper proposes autonomous mobility skeletons that encapsulate self-aware mobile coordination for common patterns of computation over collections. Autonomous mobility skeletons are akin to algorithmic skeletons in being polymorphic higher order functions, but where algorithmic skeletons abstract over parallel coordination, autonomous mobility skeletons abstract over autonomous mobile coordination. We present the automap, autofold and autoiter autonomous mobility skeletons, together with performance measurements of Jocaml, Java Voyager, and JavaGo implementations on small networks. autoiter is an unusual skeleton, abstracting over the Iterator interface commonly used with Java collections. 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cost-driven autonomous mobility

Autonomous mobile programs (AMPs) offer a novel decentralised load management technology where periodic use is made of cost models to decide where to execute in a network. In this paper we demonstrate how sequential programs can be automatically converted into AMPs. The AMPs are generated by an automatic continuation cost analyser that replaces iterations with Costed Autonomous Mobility Skeleto...

متن کامل

Developing Formal Specifications to Coordinate Heterogeneous Autonomous Agents

We have been developing an approach for the distributed coordination of heterogeneous, autonomous agents. This approach takes as input (a) agent skeletons, giving compact descriptions of the given agents in terms of their events that are significant for coordination, as well as (b) relationships among the events occurring in these skeletons. A natural question is how may the skeletons and relat...

متن کامل

Synthesizing Coordination Requirements for Heterogeneous Autonomous Agents

As agents move into ever more important applications, there is a natural growth in interest in techniques for synthesizing multiagent systems. We describe an approach for engineering the coordination requirements of a multiagent system based on an analysis of conversation instances extracted from usage scenarios. This approach exploits the notion of Dooley graphs that were recently introduced t...

متن کامل

Convex skeletons of complex networks

A convex network can be defined as such in which every connected induced subgraph includes all the shortest paths between its nodes. Fully convex network would therefore be a collection of cliques stitched together in a tree. In this paper, we study the largest high-convexity part of empirical networks obtained by removing the least number of edges, which we call a convex skeleton. A convex ske...

متن کامل

Skeletons for parallel image processing: an overview of the SKIPPER project

This paper is a general overview of the Skipper project, led at Blaise Pascal University between 1997 and 2002. The main goal of the Skipper project was to demonstrate the applicability of skeleton-based parallel programming techniques to the fast prototyping of reactive vision applications. This project has produced several versions of a full-fledged integrated parallel programming environment...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Parallel Computing

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2006